By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 3, Issue 1, pp. 1-99

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Computing Time of the Euclidean Algorithm

George E. Collins

pp. 1-10

BibTeX  Abstract Full Text:  PDF

Stack Replacement Algorithms for Two-Level Directly Addressable Paged Memories

R. R. Muntz and H. Opderbeck

pp. 11-22

BibTeX  Abstract Full Text:  PDF

Picture Skeletons Based on Eccentricities of Points of Minimum Spanning Trees

R. E. Osteen and P. P. Lin

pp. 23-40

BibTeX  Abstract Full Text:  PDF

On Backtracking: A Combinatorial Description of the Algorithm

Jay P. Fillmore and S. G. Williamson

pp. 41-55

BibTeX  Abstract Full Text:  PDF

Computing the Weak Components of a Directed Graph

Jean Francois Pacault

pp. 56-61

BibTeX  Abstract Full Text:  PDF

Finding Dominators in Directed Graphs

Robert Tarjan

pp. 62-89

BibTeX  Abstract Full Text:  PDF

First Order Graph Grammars

Curtis R. Cook

pp. 90-99

BibTeX  Abstract Full Text:  PDF